全文获取类型
收费全文 | 27278篇 |
免费 | 3660篇 |
国内免费 | 3023篇 |
专业分类
电工技术 | 1970篇 |
技术理论 | 4篇 |
综合类 | 2309篇 |
化学工业 | 205篇 |
金属工艺 | 93篇 |
机械仪表 | 980篇 |
建筑科学 | 308篇 |
矿业工程 | 467篇 |
能源动力 | 120篇 |
轻工业 | 85篇 |
水利工程 | 166篇 |
石油天然气 | 157篇 |
武器工业 | 158篇 |
无线电 | 8305篇 |
一般工业技术 | 749篇 |
冶金工业 | 99篇 |
原子能技术 | 56篇 |
自动化技术 | 17730篇 |
出版年
2024年 | 80篇 |
2023年 | 504篇 |
2022年 | 689篇 |
2021年 | 832篇 |
2020年 | 1084篇 |
2019年 | 773篇 |
2018年 | 748篇 |
2017年 | 1110篇 |
2016年 | 1375篇 |
2015年 | 1800篇 |
2014年 | 2825篇 |
2013年 | 2372篇 |
2012年 | 3166篇 |
2011年 | 2932篇 |
2010年 | 1995篇 |
2009年 | 1804篇 |
2008年 | 2026篇 |
2007年 | 1917篇 |
2006年 | 1362篇 |
2005年 | 1096篇 |
2004年 | 813篇 |
2003年 | 688篇 |
2002年 | 510篇 |
2001年 | 418篇 |
2000年 | 240篇 |
1999年 | 198篇 |
1998年 | 121篇 |
1997年 | 106篇 |
1996年 | 91篇 |
1995年 | 62篇 |
1994年 | 56篇 |
1993年 | 26篇 |
1992年 | 32篇 |
1991年 | 20篇 |
1990年 | 17篇 |
1989年 | 13篇 |
1988年 | 12篇 |
1987年 | 7篇 |
1986年 | 9篇 |
1985年 | 5篇 |
1984年 | 3篇 |
1983年 | 4篇 |
1982年 | 3篇 |
1980年 | 3篇 |
1979年 | 4篇 |
1978年 | 1篇 |
1977年 | 4篇 |
1976年 | 1篇 |
1972年 | 2篇 |
1959年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 542 毫秒
991.
Server applications augmented with behavioral adaptation logic can react to environmental changes, creating self‐managing server applications with improved quality of service at runtime. However, developing adaptive server applications is challenging due to the complexity of the underlying server technologies and highly dynamic application environments. This paper presents an architecture framework, the Adaptive Server Framework (ASF), to facilitate the development of adaptive behavior for legacy server applications. ASF provides a clear separation between the implementation of adaptive behavior and the business logic of the server application. This means a server application can be extended with programmable adaptive features through the definition and implementation of control components defined in ASF. Furthermore, ASF is a lightweight architecture in that it incurs low CPU overhead and memory usage. We demonstrate the effectiveness of ASF through a case study, in which a server application dynamically determines the resolution and quality to scale an image based on the load of the server and network connection speed. The experimental evaluation demonstrates the performance gains possible by adaptive behavior and the low overhead introduced by ASF. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
992.
Francesco Bellotti Riccardo Berta Massimiliano Margarone Alessandro De Gloria 《Software》2008,38(12):1241-1259
The RFID technology is becoming ever more popular in the development of ubiquitous computing applications. A full exploitation of the RFID potential requires the study and implementation of human–computer interaction (HCI) modalities to be able to support wide usability by the target audience. This implies the need for programming methodologies specifically dedicated to support the easy and efficient prototyping of applications to have feedback from early tests with users. On the basis of our field‐working experience, we have designed oDect, a high‐level language and platform‐independent application programming interface (API), ad hoc designed to meet the needs of typical applications for mobile devices (smart phones and PDAs). oDect aims at allowing application developers to create their prototypes focusing on the needs of the final users, without having to care about the low‐level software that interacts with the RFID hardware. Further, in an end‐user developing (EUD) approach, oDect provides specific support for the application end‐user herself to cope with typical problems of RFID applications in detecting objects. We describe in detail the features of the API and discuss the findings of a test with four programmers, where we analyse and evaluate the use of the API in four sample applications. We also present results of an end‐user test, which investigated strengths and weaknesses of the territorial agenda (TA) concept. The TA is an RFID‐based citizen guide that aids—through time‐ and location‐based reminders—users in their daily activities in a city. The TA directly exploits EUD features of oDect, in particular concerning the possibility of linking detected objects with custom actions. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
993.
This paper describes a component‐based framework for radio‐astronomical imaging software systems. We consider optimal re‐use strategies for packages of disparate architectures brought together within a modern component framework. In this practical case study, the legacy codes include both procedural and object‐oriented architectures. We consider also the special requirements on scientific component middleware, with a specific focus on high‐performance computing. We present an example application in this component architecture and outline future development planned for this project. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
994.
Windson Viana 《Journal of Systems and Software》2008,81(3):382-394
Ubiquitous Computing promises seamless access to information anytime, anywhere with different and heterogeneous devices. This kind of environment imposes new challenges to software development. For example, information and user interface should be adapted according to contextual characteristics such as user, environment, and access device. In case of device adaptation, the development challenge is related to the heterogeneity of the devices, which requires software engineers to create different versions for each type of device and every platform. This paper proposes a MB-UID (model-based user interface development) approach for semi-automatic generation of adaptive applications for mobile devices. An environment, called XMobile, offers a device-independent user interface framework and a code generation tool for providing fast development of multi-platform and adaptive applications according to device and platform features. A case study is also presented to illustrate how the environment can be used for constructing an application for heterogeneous devices with different network connectivity modes. 相似文献
995.
Reconfigurable computing (RC) applications employing both microprocessors and FPGAs have potential for large speedup when compared with traditional (software) parallel applications. However, this potential is marred by the additional complexity of these dual-paradigm systems, making it difficult to identify performance bottlenecks and achieve desired performance. Performance analysis concepts and tools are well researched and widely available for traditional parallel applications but are lacking in RC, despite being of great importance due to the applications’ increased complexity. In this paper, we explore challenges and present new techniques in automated instrumentation, runtime measurement, and visualization of RC application behavior. We also present ideas for integration with conventional performance analysis tools to create a unified tool for RC applications as well as our initial framework for FPGA instrumentation and measurement. Results from a case study are provided using a prototype of this new tool. 相似文献
996.
对赋权图上经典优化问题的DNA计算方法进行探讨,改进原有DNA计算模型中的权值编码方法,提出一些新的DNA编码方法及DNA算法.具体地说,通过设计赋权无向图的相对长度图给出了旅行商问题的一种相对长度DNA编码方法及DNA算法,通过设计赋权无向图的广义边图给出了中国邮递员问题的一种广义边图DNA编码方法及DNA算法,通过选取DNA序列的最佳逆补比对给出了最小生成树问题的一种基于逆补比对的DNA编码方法及DNA算法,通过设计从顶点覆盖问题到Hamilton回路问题的一种改进多项式变换给出了顶点覆盖问题的一种基于多项式变换的DNA编码方法及DNA算法.所设计的DNA计算方法提高了DNA计算中表示数值和处理数值的能力. 相似文献
997.
分子信标(Molecular Beacon)是一种发夹状的荧光探针,它可以特异地和那些与分子信标的环(Loop)互补的核酸靶序列杂交,具有单个碱基错配的检测能力.肽核酸(Peptide Nucleic Acid)是人工合成的核酸(DNA)的类似物.PNA骨架为酰胺键,与DNA补链杂交更稳定,可以阻止聚合酶延伸反应.文中将可满足问题的约束变量编码于分子信标的环部识别区,通过分子信标与使得给定范式为真的变量的PNA补链杂交,再利用PNA链可以阻止聚合酶延伸反应的性质,用限制性内切酶EcoRI降解对应于非解的分子信标,最后通过加热表面使分子信标构形发生变化,产生荧光读解.提出的可满足问题的分子信标计算模型具有可靠性高、无需观察和记录计算的中间结果、读解简单等优点. 相似文献
998.
基于DNA计算自组装模型的Diffie-Hellman算法破译(英文) 总被引:1,自引:0,他引:1
DNA自组装计算模型是近年来引人关注的计算模型,已有基于自组装模型的二进制加法、乘法以及有限域中的加法和乘法的讨论.文中利用DNA自组装模型设计的模乘系统,实现了素数P的本原根g连续乘方后模p的数的排列,从而可以在线性时间内求解离散对数,为破译Diffie—Hellman密钥交换算法提供了新的生物方法.该模乘系统使用了Θ(p)种自组装类型,组装的时间复杂度为Θ(p-1).系统最后组装结果提取出报告链后,经过PCR和凝胶电泳读取离散对数结果.该模型扩展了DNA自组装计算模型的应用,为求取离散对数提供了新思路. 相似文献
999.
基于粘贴和删除系统的图着色问题分析(英文) 总被引:2,自引:0,他引:2
图着色问题是图与组合优化中的一个NP-完全问题.现有算法在求解图着色问题时,计算复杂性随着待解问题规模的增大呈指数增长.粘贴系统和删除系统是分别基于粘贴运算和删除运算的两种语言生成器.文中将图着色问题和图的坏边数结合起来,将图着色问题转化成搜索最长序列的问题,然后利用粘贴系统和删除系统的并行性,得到了图的色数及其所有色类.与已有求解图着色问题的DNA算法相比,新的算法具有较低的复杂性. 相似文献
1000.